A dense disparity map of stereo images 1
نویسندگان
چکیده
We present a new algorithm for solving the stereo vision matching problem by using dynamic programming. Edge pixels extracted from two images are matched and a dense disparity map is obtained by tilling in the spaces between two consecutive edge pixels. (~) 1997 Elsevier Science B.V.
منابع مشابه
Optimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملStereo-Based Dense Disparity Estimation for Lunar Surface
A stereo-based dense disparity estimation algorithm is proposed to build high quality dense disparity map of lunar surface under special illumination, weak texture and occlusion condition. To avoidance the serious shadow effect effectively, intrinsic image of stereo images are preprocessed. A color similarity probability based belief propagation algorithm (BP) is proposed to solve the depth dis...
متن کاملSemi-Dense Stereo Correspondence with Dense Features
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse disparity maps. Our algorithm detects and matches dense features between the left and right images of a stereo pair, producing a semi-dense disparity map. Our dense feature is defined with respect to both images of a stereo ...
متن کاملFast Stereo Matching: Coarser to Finer with Selective Updating
A coarse to fine approach for fast stereo matching is presented. In this approach, a dynamic programming (DP) based algorithm at the top of the pyramid is applied to obtain an initial coarse dense disparity map of high quality and to reduce computational cost. In each finer layer, a new dense disparity map is inherited from the coarser layer by interpolation. The new dense disparity map will be...
متن کاملStereo Matching Algorithm Using a Weighted Average of Costs Aggregated by Various Window Sizes
A window-based stereo matching, which matches pixel values within a window between two images, produces a dense disparity map, and as a result, constructs a dense depth structure. Many algorithms of the window-based stereo matching have been proposed. The conventional algorithms, however, face a trade-off between accuracies of the disparity map in disparity continuity and discontinuity regions ...
متن کامل